2 Comprehensive Grobner System with Inexact Input
نویسنده
چکیده
Grabner basis is olle of the most important tools ill recent symbolic algebraic computations. Howe\'er, computing a Grobncr basis fo r the given polynomial ideal is lIot easy and it is lIot numcric.. . l1y stable if polynomials have inexact coefficients. I n this paper, we study what we should get for computing a Grabner basis with inexact coefficients alld introduce a naive method to compute a Grabner basis by reduced row echelon form , for the ideal generated by the given polynomial set having a priori errors on their coefficients.
منابع مشابه
Applying Buchberger's criteria on Montes's DisPGB algorithm
The concept of comprehensive Grobner bases was introduced by Weispfenning. Montes has proposed an efficient algorithm for computing these bases. But he has not explicitly used Buchberger's criteria in his algorithm. In this paper we prove that we can apply these criteria on Montes algorithm. We propose a modified version of Montes algorithm and evaluate its performance via some examples.
متن کاملAn inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملInput-output equations and observability for polynomial delay systems
This paper discusses a result by Fliess about input-output equations [or polynomial systems with time delays, and strengthens the result somewhat. The proof given is more detailed and opens the way [or constructive methods [or determining the input-output behavior. Some such methods based on Grobner bases are described in detail. Furthermore, some connections with observability are exploited.
متن کاملLeast-squares integration of one-dimensional codistributions with application to approximate feedback linearization
We study the problem of approximating one-dimensional nonintegrable codistributions by integrable ones and apply the resulting approximations to approximate feedback linearization of single-input systems. The approach derived in this paper allows one to nd a linearizable nonlinear system that is close to the given system in a least squares (L 2) sense. A linearly controllable single input aane ...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کامل